Compression into two-component PLS factorizations
نویسندگان
چکیده
منابع مشابه
Inequivalent Transitive Factorizations into Transpositions
The question of counting minimal factorizations of permutations into transpositions that act transitively on a set has been studied extensively in the geometrical setting of ramified coverings of the sphere and in the algebraic setting of symmetric functions. It is natural, however, from a combinatorial point of view to ask how such results are affected by counting up to equivalence of factoriz...
متن کاملEmbedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations
Motivated by a 40-year-old problem due to Peter Cameron on extending partial parallelisms, we provide necessary and sufficient conditions under which one can extend an r-factorization of a complete 3-uniform hypergraph on m vertices, K3 m, to an s-factorization of K3 n. This generalizes an existing result of Baranyai and Brouwer–where they proved it for the case r = s = 1.
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملUniqueness of linear factorizations into independent subspaces
Given a random vector X, we address the question of linear separability of X, that is, the task of finding a linear operator W such that we have (S1, . . . ,SM ) = (WX) with statistically independent random vectors Si. As this requirement alone is already fulfilled trivially by X being independent of the empty rest, we require that the components be not further decomposable. We show that if X h...
متن کاملMinimal Transitive Factorizations of Permutations into Cycles
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings, that is, we study the number Hα(i2, i3, . . . ) of ways a given permutation (with cycles described by the partitionα) can be decomposed into a product of exactly i2 2-cycles, i3 3-cycles, etc., with certain minimality and transitivity conditions imposed on the factors. The method is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemometrics
سال: 2003
ISSN: 0886-9383,1099-128X
DOI: 10.1002/cem.803